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 listSep 5, 2026 13:00wnwnScore: 3,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:013,42636,891,98327,405,0001,039,0002,113,536
2Sep 5, 2026 13:013,43036,932,41627,439,0001,034,0002,113,536
3Sep 5, 2026 13:013,44436,996,14327,559,0001,031,0002,113,536
4Sep 5, 2026 13:013,44937,072,69527,598,0001,031,0002,113,536
5Sep 5, 2026 13:013,45336,927,04627,614,0001,050,0002,113,536
6Sep 5, 2026 13:013,48137,153,85427,852,0001,047,0002,113,536
7Sep 5, 2026 13:013,63038,618,77629,098,0001,034,0002,113,536
8Sep 5, 2026 13:013,65338,809,41029,320,0001,005,0002,113,536
9Sep 5, 2026 13:013,69846,769,15529,647,0001,047,0002,113,536