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 21, 2026 10:09BenBenScore: 23,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 10:0923,337218,575,069183,716,0009,984,0002,330,624
2Apr 21, 2026 10:0923,347217,205,530185,797,0007,991,0002,322,432
3Apr 21, 2026 10:0923,350218,751,189186,817,0006,993,0002,383,872
4Apr 21, 2026 10:0923,355218,648,870185,860,0007,994,0002,326,528
5Apr 21, 2026 10:0923,360219,602,657185,895,0007,995,0002,326,528
6Apr 21, 2026 10:0923,386207,544,935185,103,0009,005,0002,383,872
7Apr 21, 2026 10:0923,410207,552,056181,284,00013,020,0002,330,624
8Apr 21, 2026 10:0923,412219,543,465182,303,00012,019,0002,326,528
9Apr 21, 2026 10:0923,640223,823,978186,203,00010,010,0002,334,720