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 18:45Josu San MartinJosu San MartinScore: 5,774Success
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 18:455,64765,096,49945,844,0001,027,0002,338,816
2May 9, 2026 18:455,69165,504,49646,196,0001,045,0002,355,200
3May 9, 2026 18:455,70263,564,84646,289,0001,040,0002,342,912
4May 9, 2026 18:455,72461,853,79346,482,0001,030,0002,347,008
5May 9, 2026 18:455,77465,139,67246,902,0001,029,0002,338,816
6May 9, 2026 18:455,82163,549,89347,301,0001,020,0002,351,104
7May 9, 2026 18:455,88366,893,61147,793,0001,037,0002,347,008
8May 9, 2026 18:456,16269,463,51750,107,0001,043,0002,342,912
9May 9, 2026 18:456,18267,312,40150,297,0001,021,0002,347,008