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 12, 2026 04:51Josu San MartinJosu San MartinScore: 5,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 21:445,08868,874,93740,220,0002,011,0002,297,856
2Apr 16, 2026 21:445,11467,381,85840,425,0002,021,0002,506,752
3Apr 12, 2026 04:515,18567,507,64840,036,0003,002,0002,297,856
4Apr 12, 2026 04:515,36366,506,42842,494,0002,023,0002,297,856
5Apr 16, 2026 21:445,44369,151,84142,168,0003,012,0002,297,856
6Apr 12, 2026 04:515,48877,504,56443,530,0002,024,0002,297,856