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 07:47wnwnScore: 3,482Success
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 07:503,32636,915,67226,594,0001,017,0002,113,536
2May 11, 2026 07:503,34035,181,70526,691,0001,037,0002,113,536
3May 11, 2026 07:503,40735,525,51727,263,0001,021,0002,113,536
4May 11, 2026 07:503,45638,318,40627,677,0001,009,0002,113,536
5May 11, 2026 07:503,48239,306,69027,899,0001,003,0002,113,536
6May 11, 2026 07:503,50136,196,08528,064,0001,002,0002,113,536
7May 11, 2026 07:503,50638,145,28128,097,0001,005,0002,113,536
8May 11, 2026 07:503,53136,510,17928,287,0001,025,0002,113,536
9May 11, 2026 07:503,53737,745,96028,246,0001,116,0002,113,536