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 14, 2026 01:24Victor MerckléVictor MerckléScore: 7,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 14, 2026 01:247,47869,451,57762,071,00002,113,536
2May 14, 2026 01:247,47972,220,76861,059,0001,020,0002,113,536
3May 14, 2026 01:247,47971,171,06561,071,0001,008,0002,113,536
4May 14, 2026 01:247,48070,408,60161,064,0001,023,0002,113,536
5May 14, 2026 01:247,48269,323,78761,061,0001,041,0002,113,536
6May 14, 2026 01:247,48471,709,40161,111,0001,011,0002,113,536
7May 14, 2026 01:247,50671,377,61162,301,00002,113,536
8May 14, 2026 01:247,52371,505,55861,429,0001,018,0002,113,536
9May 14, 2026 01:247,62770,604,18662,293,0001,017,0002,113,536