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 listApr 20, 2026 22:22Josu San MartinJosu San MartinScore: 5,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 22:224,87267,430,11739,434,0001,011,0002,383,872
2Apr 20, 2026 22:224,95565,519,61339,122,0002,006,0002,383,872
3Apr 20, 2026 22:225,03970,367,47439,838,0001,991,0002,375,680
4Apr 20, 2026 22:225,04064,689,17639,842,0001,992,0002,277,376
5Apr 20, 2026 22:225,04564,294,97539,882,0001,994,0002,383,872
6Apr 20, 2026 22:225,06467,517,16340,035,0002,001,0002,379,776
7Apr 20, 2026 22:225,09066,317,21740,242,0002,012,0002,379,776
8Apr 20, 2026 22:225,12353,447,41040,502,0002,025,0002,494,464
9Apr 20, 2026 22:225,15870,371,87940,826,0001,991,0002,387,968