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 listFeb 19, 2026 19:21wnwnScore: 5,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 19:215,16567,402,14440,874,0001,993,0002,449,408
2Feb 19, 2026 19:215,16673,470,64341,881,000997,0002,437,120
3Feb 19, 2026 19:245,17066,625,68440,912,0001,995,0002,441,216
4Feb 19, 2026 19:245,18864,807,86042,063,0001,001,0002,437,120
5Feb 19, 2026 19:245,19068,474,69042,074,0001,001,0002,445,312
6Feb 19, 2026 19:215,19170,729,57738,077,0005,010,0002,535,424
7Feb 19, 2026 19:215,20167,323,22740,158,0003,011,0002,277,376
8Feb 19, 2026 19:215,22666,745,13443,379,00002,535,424
9Feb 19, 2026 19:215,22769,929,74943,384,00002,273,280