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 listMar 18, 2026 15:56Josu San MartinJosu San MartinScore: 5,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 15:564,99066,969,03640,404,0001,010,0002,281,472
2Mar 18, 2026 15:565,07764,367,29540,136,0002,006,0002,400,256
3Mar 18, 2026 15:565,08167,098,25240,168,0002,008,0002,281,472
4Mar 18, 2026 16:015,09165,652,86140,245,0002,012,0002,281,472
5Mar 18, 2026 16:015,21367,705,26941,253,0002,012,0002,281,472
6Mar 18, 2026 15:565,28170,236,87141,840,0001,992,0002,408,448
7Mar 18, 2026 16:015,28171,078,13542,839,000996,0002,416,640
8Mar 18, 2026 15:565,30064,414,29641,994,0001,999,0002,498,560
9Mar 18, 2026 15:565,35764,456,94543,453,0001,010,0002,281,472