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 24, 2026 04:17wnwnScore: 3,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:183,30236,109,51026,385,0001,029,0002,113,536
2Sep 24, 2026 04:183,30336,178,61526,351,0001,072,0002,113,536
3Sep 24, 2026 04:183,32536,319,05226,561,0001,040,0002,113,536
4Sep 24, 2026 04:183,32836,367,26326,619,0001,010,0002,113,536
5Sep 24, 2026 04:183,40137,684,07127,222,0001,010,0002,113,536
6Sep 24, 2026 04:183,48538,344,51027,927,0001,006,0002,113,536
7Sep 24, 2026 04:183,49838,542,66028,035,0001,003,0002,113,536
8Sep 24, 2026 04:183,51238,668,53128,137,0001,020,0002,113,536
9Sep 24, 2026 04:183,53438,786,86528,324,0001,010,0002,113,536