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 listAug 31, 2026 04:38Josu San MartinJosu San MartinScore: 4,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 04:414,21143,423,93633,930,0001,025,0002,113,536
2Aug 31, 2026 04:414,21743,508,54833,977,0001,031,0002,113,536
3Aug 31, 2026 04:414,21943,431,23433,991,0001,032,0002,113,536
4Aug 31, 2026 04:414,22343,539,64134,002,0001,049,0002,113,536
5Aug 31, 2026 04:414,23143,562,77633,994,0001,125,0002,113,536
6Aug 31, 2026 04:414,23343,569,95834,104,0001,032,0002,113,536
7Aug 31, 2026 04:414,25144,392,58234,149,0001,136,0002,113,536
8Aug 31, 2026 04:414,25743,751,50034,297,0001,040,0002,113,536
9Aug 31, 2026 04:414,34545,662,35535,023,0001,046,0002,113,536