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 04:02Andrew EpsteinAndrew EpsteinScore: 58,510Success
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 04:1158,205493,819,663481,102,0002,003,0002,121,728stderr
2Nov 3, 2026 04:1158,221492,526,252481,228,0002,010,0002,121,728stderr
3Nov 3, 2026 04:1158,337493,950,450482,192,0002,012,0002,121,728stderr
4Nov 3, 2026 04:1158,411494,652,804482,798,0002,021,0002,121,728stderr
5Nov 3, 2026 04:1158,510494,917,850483,629,0002,006,0002,121,728stderr
6Nov 3, 2026 04:1158,530495,667,609483,788,0002,011,0002,121,728stderr
7Nov 3, 2026 04:1158,599495,637,461484,359,0002,014,0002,121,728stderr
8Nov 3, 2026 04:1158,618496,248,086484,515,0002,016,0002,121,728stderr
9Nov 3, 2026 04:1159,020499,597,278487,858,0002,013,0002,121,728stderr