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 listMay 20, 2026 05:45M-RochatM-RochatScore: 12,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:4612,445115,150,802100,953,0002,343,0002,113,536
2May 20, 2026 05:4612,457114,202,530101,047,0002,351,0002,113,536
3May 20, 2026 05:4612,463112,957,829101,113,0002,333,0002,113,536
4May 20, 2026 05:4612,470113,561,214101,154,0002,353,0002,113,536
5May 20, 2026 05:4612,496113,981,130101,710,0002,010,0002,113,536
6May 20, 2026 05:4612,514115,511,899101,817,0002,053,0002,113,536
7May 20, 2026 05:4612,520113,534,416101,886,0002,034,0002,113,536
8May 20, 2026 05:4612,546114,401,673101,788,0002,351,0002,113,536
9May 20, 2026 05:4612,585116,219,783102,384,0002,074,0002,113,536