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:59M-RochatM-RochatScore: 11,980Success
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 06:0011,940110,571,54396,772,0002,335,0002,113,536
2May 20, 2026 06:0011,943108,548,98196,786,0002,347,0002,113,536
3May 20, 2026 06:0011,956110,478,49496,898,0002,344,0002,113,536
4May 20, 2026 06:0011,965111,368,67896,979,0002,337,0002,113,536
5May 20, 2026 06:0011,980109,678,32197,399,0002,038,0002,113,536
6May 20, 2026 06:0012,045110,197,44497,918,0002,058,0002,113,536
7May 20, 2026 06:0012,051112,038,41697,958,0002,073,0002,113,536
8May 20, 2026 06:0012,060111,810,73498,037,0002,062,0002,113,536
9May 20, 2026 06:0012,090111,537,72398,236,0002,114,0002,113,536