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 listJul 5, 2026 21:24Kevin HeaveyKevin HeaveyScore: 7,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:256,83166,205,28055,639,0001,065,0002,117,632
2Jul 5, 2026 21:256,83566,288,68655,656,0001,075,0002,117,632
3Jul 5, 2026 21:256,87366,566,91055,969,0001,083,0002,117,632
4Jul 5, 2026 21:256,96167,394,41256,576,0001,201,0002,117,632
5Jul 5, 2026 21:257,03767,911,27457,261,0001,150,0002,117,632
6Jul 5, 2026 21:257,03867,915,55557,351,0001,068,0002,117,632
7Jul 5, 2026 21:257,06568,123,75257,572,0001,068,0002,117,632
8Jul 5, 2026 21:257,08068,190,06457,699,0001,071,0002,117,632
9Jul 5, 2026 21:257,08168,247,49057,715,0001,062,0002,117,632