Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listNov 3, 2026 10:26Andrew EpsteinAndrew EpsteinScore: 37,110Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 10:3236,951316,120,425304,686,0002,014,0002,121,728stderr
2Nov 3, 2026 10:3237,012316,375,572305,194,0002,012,0002,121,728stderr
3Nov 3, 2026 10:3237,074319,038,849305,688,0002,031,0002,121,728stderr
4Nov 3, 2026 10:3237,109317,301,064306,004,0002,008,0002,125,824stderr
5Nov 3, 2026 10:3237,110317,233,088306,012,0002,007,0002,129,920stderr
6Nov 3, 2026 10:3237,137317,445,274306,236,0002,007,0002,125,824stderr
7Nov 3, 2026 10:3237,257319,087,431307,230,0002,010,0002,121,728stderr
8Nov 3, 2026 10:3237,311319,392,521307,678,0002,008,0002,121,728stderr
9Nov 3, 2026 10:3237,316319,602,305307,702,0002,023,0002,121,728stderr