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 listMay 11, 2026 15:41wnwnScore: 3,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:423,32435,479,44627,590,00002,113,536
2May 11, 2026 15:423,33536,817,85627,687,00002,113,536
3May 11, 2026 15:423,34535,672,45027,771,00002,113,536
4May 11, 2026 15:423,34636,288,26826,773,0001,002,0002,113,536
5May 11, 2026 15:423,45237,738,91628,653,00002,113,536
6May 11, 2026 15:423,49436,417,81429,008,00002,113,536
7May 11, 2026 15:423,50136,437,17129,063,00002,113,536
8May 11, 2026 15:423,51036,436,29329,139,00002,113,536
9May 11, 2026 15:423,51537,916,42529,175,00002,113,536