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:16wnwnScore: 3,484Success
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:163,29836,140,49026,346,0001,032,0002,113,536
2Sep 24, 2026 04:163,30436,167,76326,384,0001,040,0002,113,536
3Sep 24, 2026 04:163,31936,334,88226,528,0001,026,0002,113,536
4Sep 24, 2026 04:163,33836,514,41826,682,0001,031,0002,113,536
5Sep 24, 2026 04:163,48438,389,97627,900,0001,018,0002,113,536
6Sep 24, 2026 04:163,49438,519,74427,892,0001,116,0002,113,536
7Sep 24, 2026 04:163,49638,519,24528,020,0001,002,0002,113,536
8Sep 24, 2026 04:163,49737,799,51928,020,0001,009,0002,113,536
9Sep 24, 2026 04:163,52438,047,60428,214,0001,037,0002,113,536