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 23:36Taylor DettlingTaylor DettlingScore: 51,394Success
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 23:3651,304451,694,343423,831,0001,999,0002,342,912
2Apr 20, 2026 23:3651,310455,710,892423,882,0001,999,0002,342,912
3Apr 20, 2026 23:3651,328448,618,323424,029,0002,000,0002,334,720
4Apr 20, 2026 23:3651,393451,729,853424,569,0001,997,0002,347,008
5Apr 20, 2026 23:3651,394455,568,169424,574,0001,997,0002,342,912
6Apr 20, 2026 23:3651,396454,555,500424,597,0001,998,0002,338,816
7Apr 20, 2026 23:3651,424454,601,916424,825,0001,999,0002,347,008
8Apr 20, 2026 23:3651,440439,697,885423,956,0002,999,0002,277,376
9Apr 20, 2026 23:3651,541448,432,682422,784,0005,009,0002,342,912