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 19:51Karthik ReddyKarthik ReddyScore: 27,434Success
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 19:5226,629231,306,317220,020,0001,008,0002,113,536
2Sep 24, 2026 19:5226,671231,675,289220,365,0001,009,0002,113,536
3Sep 24, 2026 19:5226,740232,305,999220,936,0001,009,0002,113,536
4Sep 24, 2026 19:5227,428237,932,711226,651,0001,008,0002,113,536
5Sep 24, 2026 19:5227,434237,928,653226,700,0001,009,0002,113,536
6Sep 24, 2026 19:5227,443238,132,763226,768,0001,009,0002,113,536
7Sep 24, 2026 19:5227,444237,988,481226,779,0001,007,0002,113,536
8Sep 24, 2026 19:5227,453238,117,048226,857,0001,008,0002,113,536
9Sep 24, 2026 19:5227,455238,151,181226,872,0001,008,0002,113,536