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 06:24Victor MerckléVictor MerckléScore: 6,997Success
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 06:246,99567,222,36057,054,0001,008,0002,113,536
2May 14, 2026 06:246,99666,408,07157,064,0001,004,0002,113,536
3May 14, 2026 06:246,99765,658,93057,076,0001,001,0002,113,536
4May 14, 2026 06:246,99765,357,77058,076,00002,113,536
5May 14, 2026 06:246,99767,243,52857,039,0001,039,0002,113,536
6May 14, 2026 06:247,00165,476,43158,116,00002,113,536
7May 14, 2026 06:247,00668,309,92557,155,0001,001,0002,113,536
8May 14, 2026 06:247,00867,015,40757,146,0001,024,0002,113,536
9May 14, 2026 06:247,04967,608,94057,498,0001,014,0002,113,536