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 10:03wnwnScore: 3,468Success
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 10:033,42344,542,67127,398,0001,014,0002,330,624
2Apr 27, 2026 10:033,45147,430,80527,622,0001,023,0002,482,176
3Apr 27, 2026 10:033,46646,318,63926,791,0001,984,0002,498,560
4Apr 27, 2026 10:033,46841,264,81526,807,0001,985,0002,486,272
5Apr 27, 2026 10:033,46842,851,69426,804,0001,985,0002,482,176
6Apr 27, 2026 10:033,51047,608,69127,132,0002,009,0002,486,272
7Apr 27, 2026 10:033,56449,047,03228,566,0001,020,0002,486,272
8Apr 27, 2026 10:033,57346,722,43228,639,0001,022,0002,486,272
9Apr 27, 2026 10:033,60548,568,38727,932,0001,995,0002,486,272