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 listJun 26, 2026 09:38Victor MerckléVictor MerckléScore: 5,050Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 09:395,03249,461,44640,660,0001,111,0002,113,536
2Jun 26, 2026 09:395,03349,515,24040,691,0001,091,0002,113,536
3Jun 26, 2026 09:395,03749,737,60940,699,0001,115,0002,113,536
4Jun 26, 2026 09:395,04949,614,55040,888,0001,019,0002,113,536
5Jun 26, 2026 09:395,05049,553,78540,916,0001,003,0002,113,536
6Jun 26, 2026 09:395,06449,692,51641,006,0001,029,0002,113,536
7Jun 26, 2026 09:395,06949,793,07241,073,0001,003,0002,113,536
8Jun 26, 2026 09:395,09349,968,63941,178,0001,094,0002,113,536
9Jun 26, 2026 09:395,10450,088,64441,318,0001,047,0002,113,536