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 27, 2026 18:48Karthik ReddyKarthik ReddyScore: 5,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 18:525,31554,580,87643,012,0001,104,0002,113,536
2Sep 27, 2026 18:525,32954,652,18343,129,0001,109,0002,113,536
3Sep 27, 2026 18:525,32954,647,30043,133,0001,098,0002,113,536
4Sep 27, 2026 18:525,33354,747,23543,169,0001,101,0002,113,536
5Sep 27, 2026 18:525,34454,844,04543,268,0001,094,0002,113,536
6Sep 27, 2026 18:525,34554,820,60543,239,0001,125,0002,113,536
7Sep 27, 2026 18:525,35255,053,72243,314,0001,112,0002,113,536
8Sep 27, 2026 18:525,35354,844,09843,348,0001,085,0002,113,536
9Sep 27, 2026 18:525,40655,311,54743,758,0001,116,0002,113,536