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 06:59wnwnScore: 3,299Success
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 06:593,28735,859,94627,289,00002,113,536
2May 11, 2026 06:593,29236,557,32327,328,00002,113,536
3May 11, 2026 06:593,29237,014,29627,327,00002,113,536
4May 11, 2026 06:593,29635,629,14127,358,00002,113,536
5May 11, 2026 06:593,29934,687,18827,387,00002,113,536
6May 11, 2026 06:593,31837,371,88027,542,00002,113,536
7May 11, 2026 06:593,33034,829,21827,646,00002,113,536
8May 11, 2026 06:593,41238,459,31327,312,0001,009,0002,113,536
9May 11, 2026 06:593,41637,318,16328,356,00002,113,536