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 07:47wnwnScore: 3,450Success
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 07:473,40341,323,44928,246,00002,482,176
2Apr 27, 2026 07:473,40643,645,17427,261,0001,009,0002,490,368
3Apr 27, 2026 07:473,40846,148,30927,280,0001,010,0002,490,368
4Apr 27, 2026 07:473,44342,709,44527,563,0001,020,0002,330,624
5Apr 27, 2026 07:473,45042,533,48227,613,0001,022,0002,330,624
6Apr 27, 2026 07:473,47045,681,81926,818,0001,986,0002,486,272
7Apr 27, 2026 07:473,48443,654,47026,929,0001,994,0002,494,464
8Apr 27, 2026 07:473,48442,110,33226,926,0001,994,0002,482,176
9Apr 27, 2026 07:473,60145,350,15027,903,0001,993,0002,490,368