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 21, 2026 03:57Andrew EpsteinAndrew EpsteinScore: 4,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 03:584,16444,384,45332,497,0002,068,0002,113,536
2Aug 21, 2026 03:584,16544,303,44732,380,0002,196,0002,113,536
3Aug 21, 2026 03:584,18644,498,37732,545,0002,203,0002,113,536
4Aug 21, 2026 03:584,18644,543,26632,516,0002,233,0002,113,536
5Aug 21, 2026 03:584,19644,618,18032,620,0002,208,0002,113,536
6Aug 21, 2026 03:584,20944,684,13732,749,0002,186,0002,113,536
7Aug 21, 2026 03:584,21844,791,75832,827,0002,183,0002,113,536
8Aug 21, 2026 03:584,22144,715,32132,841,0002,195,0002,113,536
9Aug 21, 2026 03:584,24444,973,16733,005,0002,227,0002,113,536