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 4, 2026 00:27Josu San MartinJosu San MartinScore: 6,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:285,99559,074,32446,569,0003,192,0002,113,536
2Jul 4, 2026 00:286,00859,196,77546,716,0003,153,0002,113,536
3Jul 4, 2026 00:286,04059,463,26046,834,0003,302,0002,113,536
4Jul 4, 2026 00:286,08359,898,10547,304,0003,192,0002,113,536
5Jul 4, 2026 00:286,18660,658,12548,280,0003,071,0002,113,536
6Jul 4, 2026 00:286,26561,319,25348,722,0003,278,0002,113,536
7Jul 4, 2026 00:286,32261,845,38649,424,0003,050,0002,113,536
8Jul 4, 2026 00:287,12968,522,07255,996,0003,179,0002,113,536
9Jul 4, 2026 00:287,25869,746,00157,023,0003,221,0002,113,536