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 listFeb 22, 2026 18:37wnwnScore: 5,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 18:384,99964,244,60840,480,0001,012,0002,494,464
2Feb 22, 2026 18:375,01168,371,47340,574,0001,014,0002,277,376
3Feb 22, 2026 18:375,01472,014,60040,600,0001,015,0002,531,328
4Feb 22, 2026 18:385,04167,313,58039,850,0001,992,0002,277,376
5Feb 22, 2026 18:375,04861,983,91239,902,0001,995,0002,277,376
6Feb 22, 2026 18:385,05262,483,01539,933,0001,996,0002,486,272
7Feb 22, 2026 18:385,05464,250,96939,948,0001,997,0002,494,464
8Feb 22, 2026 18:385,06264,874,74640,012,0002,000,0002,494,464
9Feb 22, 2026 18:385,06765,628,95140,053,0002,002,0002,277,376
10Feb 22, 2026 18:385,06865,050,83140,065,0002,003,0002,277,376
11Feb 22, 2026 18:385,16171,167,29941,837,000996,0002,277,376
12Feb 22, 2026 18:385,16265,293,90240,851,0001,992,0002,277,376