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 04:48M-RochatM-RochatScore: 58,397Success
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 04:5458,143491,811,558419,159,00063,430,0002,142,208
2May 20, 2026 04:5458,218492,371,148419,712,00063,499,0002,138,112
3May 20, 2026 04:5458,247492,600,898419,767,00063,688,0002,203,648
4May 20, 2026 04:5458,320493,887,439420,702,00063,362,0002,142,208
5May 20, 2026 04:5458,397493,847,751420,592,00064,107,0002,142,208
6May 20, 2026 04:5458,403493,943,896421,809,00062,938,0002,142,208
7May 20, 2026 04:5458,430496,187,450420,788,00064,185,0002,142,208
8May 20, 2026 04:5458,471494,488,556422,438,00062,878,0002,142,208
9May 20, 2026 04:5458,634497,327,675423,777,00062,888,0002,142,208