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 9, 2026 21:22Josu San MartinJosu San MartinScore: 5,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 21:225,54563,825,26344,999,0001,026,0002,355,200
2May 9, 2026 21:225,56663,690,32844,986,0001,216,0002,351,104
3May 9, 2026 21:225,56864,710,05945,187,0001,029,0002,347,008
4May 9, 2026 21:225,58162,113,65045,273,0001,053,0002,347,008
5May 9, 2026 21:225,62662,695,02745,670,0001,032,0002,355,200
6May 9, 2026 21:225,68166,821,27046,106,0001,047,0002,347,008
7May 9, 2026 21:225,71164,396,70546,386,0001,022,0002,355,200
8May 9, 2026 21:225,76365,084,82646,809,0001,027,0002,351,104
9May 9, 2026 21:225,83867,844,04447,429,0001,031,0002,355,200