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 10, 2026 03:07Josu San MartinJosu San MartinScore: 4,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 03:084,58755,056,40136,882,0001,198,0002,457,600
2May 10, 2026 03:084,60852,507,11537,070,0001,181,0002,457,600
3May 10, 2026 03:084,63653,792,07537,269,0001,212,0002,465,792
4May 10, 2026 03:084,65654,383,06637,433,0001,218,0002,453,504
5May 10, 2026 03:084,69557,080,66637,782,0001,189,0002,461,696
6May 10, 2026 03:084,72754,964,54238,044,0001,191,0002,461,696
7May 10, 2026 03:084,74757,386,67538,187,0001,219,0002,461,696
8May 10, 2026 03:084,75857,605,38038,304,0001,188,0002,457,600
9May 10, 2026 03:084,76256,044,01038,310,0001,217,0002,461,696