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 18, 2026 23:15poilonpoilonScore: 18,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 23:1617,436155,534,196143,712,0001,012,0002,113,536
2May 18, 2026 23:1617,475156,073,907144,036,0001,010,0002,113,536
3May 18, 2026 23:1617,508154,887,003144,312,0001,010,0002,113,536
4May 18, 2026 23:1618,399163,369,251151,709,0001,010,0002,113,536
5May 18, 2026 23:1618,412162,782,447151,812,0001,010,0002,113,536
6May 18, 2026 23:1618,422162,966,522151,894,0001,011,0002,113,536
7May 18, 2026 23:1618,439162,399,904152,034,0001,010,0002,113,536
8May 18, 2026 23:1618,473164,503,763152,317,0001,011,0002,113,536
9May 18, 2026 23:1618,483167,655,551152,399,0001,010,0002,113,536