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 18, 2026 12:35boop34boop34Score: 9,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 12:489,20086,222,01075,324,0001,039,0002,113,536
2Jul 18, 2026 12:489,21486,337,27275,427,0001,055,0002,113,536
3Jul 18, 2026 12:489,22186,334,69275,470,0001,069,0002,113,536
4Jul 18, 2026 12:489,22687,025,94975,487,0001,092,0002,113,536
5Jul 18, 2026 12:489,23786,464,21975,609,0001,064,0002,113,536
6Jul 18, 2026 12:489,24887,721,24675,698,0001,068,0002,113,536
7Jul 18, 2026 12:489,25487,356,14875,706,0001,109,0002,113,536
8Jul 18, 2026 12:489,30587,707,38976,156,0001,076,0002,113,536
9Jul 18, 2026 12:489,73591,281,67979,742,0001,059,0002,113,536