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 22, 2026 11:10wnwnScore: 3,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 11:103,42241,854,96027,394,0001,014,0002,486,272
2Apr 22, 2026 11:103,43945,959,75427,529,0001,019,0002,486,272
3Apr 22, 2026 11:103,47646,035,36926,867,0001,990,0002,486,272
4Apr 22, 2026 11:103,48242,122,07826,910,0001,993,0002,490,368
5Apr 22, 2026 11:103,48748,157,45626,952,0001,996,0002,486,272
6Apr 22, 2026 11:103,51044,030,42527,131,0002,009,0002,473,984
7Apr 22, 2026 11:103,55548,188,78928,495,0001,017,0002,330,624
8Apr 22, 2026 11:103,59644,041,41927,863,0001,990,0002,486,272
9Apr 22, 2026 11:103,61948,307,98528,036,0002,002,0002,482,176