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 listApr 27, 2026 04:54wnwnScore: 3,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 04:553,40343,947,90027,240,0001,008,0002,494,464
2Apr 27, 2026 04:553,40949,751,51927,288,0001,010,0002,486,272
3Apr 27, 2026 04:553,40942,577,30427,290,0001,010,0002,482,176
4Apr 27, 2026 04:553,43146,191,43727,463,0001,017,0002,473,984
5Apr 27, 2026 04:553,44444,212,42427,571,0001,021,0002,486,272
6Apr 27, 2026 04:553,45246,582,62227,634,0001,023,0002,490,368
7Apr 27, 2026 04:553,45646,614,34826,714,0001,978,0002,330,624
8Apr 27, 2026 04:553,50346,318,83127,074,0002,005,0002,482,176
9Apr 27, 2026 04:553,51347,122,67029,158,00002,330,624