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 29, 2026 09:55wnwnScore: 3,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 09:563,26135,950,81527,068,000020,480
2Sep 29, 2026 09:563,26735,779,93027,120,000020,480
3Sep 29, 2026 09:563,32336,307,61127,587,000020,480
4Sep 29, 2026 09:563,34336,612,34427,747,000020,480
5Sep 29, 2026 09:563,39436,896,75828,172,000020,480
6Sep 29, 2026 09:563,43637,213,77828,524,000020,480
7Sep 29, 2026 09:563,44038,037,45728,558,000020,480
8Sep 29, 2026 09:563,44437,370,30228,587,000020,480
9Sep 29, 2026 09:563,44637,607,93528,608,000020,480