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 listSep 5, 2026 13:06wnwnScore: 3,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:083,47437,291,64327,806,0001,036,0002,113,536
2Sep 5, 2026 13:083,47537,260,87027,821,0001,029,0002,113,536
3Sep 5, 2026 13:083,48137,264,72627,866,0001,028,0002,113,536
4Sep 5, 2026 13:083,55137,860,78928,476,0001,004,0002,113,536
5Sep 5, 2026 13:083,59138,967,22328,803,0001,003,0002,113,536
6Sep 5, 2026 13:083,62738,737,18329,100,0001,006,0002,113,536
7Sep 5, 2026 13:083,63838,636,63629,168,0001,034,0002,113,536
8Sep 5, 2026 13:083,66538,831,28429,389,0001,035,0002,113,536
9Sep 5, 2026 13:083,70039,171,72629,675,0001,041,0002,113,536