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 16:10wnwnScore: 3,308Success
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 16:113,28435,808,77727,261,00002,113,536
2May 11, 2026 16:113,28634,408,76527,280,00002,113,536
3May 11, 2026 16:113,30036,597,65327,391,00002,113,536
4May 11, 2026 16:113,30736,950,00027,449,00002,113,536
5May 11, 2026 16:113,30834,751,95327,458,00002,113,536
6May 11, 2026 16:113,31636,158,76226,520,0001,010,0002,113,536
7May 11, 2026 16:113,47637,245,14827,782,0001,069,0002,113,536
8May 11, 2026 16:113,49138,267,24827,962,0001,018,0002,113,536
9May 11, 2026 16:113,49638,275,93229,017,00002,113,536