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 7, 2026 08:31wnwnScore: 3,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:343,83047,461,65630,736,0001,061,0002,490,368
2May 7, 2026 08:343,84746,782,63630,899,0001,032,0002,482,176
3May 7, 2026 08:343,89648,826,13631,267,0001,072,0002,486,272
4May 7, 2026 08:343,95049,837,43031,688,0001,102,0002,486,272
5May 7, 2026 08:343,95448,462,42731,730,0001,095,0002,482,176
6May 7, 2026 08:343,96347,936,32031,753,0001,145,0002,473,984
7May 7, 2026 08:343,97149,611,28531,879,0001,085,0002,482,176
8May 7, 2026 08:343,99148,857,88532,031,0001,101,0002,490,368
9May 7, 2026 08:344,01948,360,41232,269,0001,092,0002,482,176