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 listAug 16, 2026 15:23marko1597marko1597Score: 5,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 15:264,98350,540,51740,355,0001,010,0002,117,632
2Aug 16, 2026 15:265,03852,122,81540,811,0001,007,0002,117,632
3Aug 16, 2026 15:265,23251,887,76042,417,0001,016,0002,117,632
4Aug 16, 2026 15:265,26051,959,36142,651,0001,007,0002,117,632
5Aug 16, 2026 15:265,26352,850,69342,666,0001,023,0002,117,632
6Aug 16, 2026 15:265,73355,822,90446,570,0001,018,0002,117,632
7Aug 16, 2026 15:265,91558,054,71148,079,0001,020,0002,117,632
8Aug 16, 2026 15:266,03962,498,95549,108,0001,016,0002,117,632
9Aug 16, 2026 15:266,10758,861,59649,661,0001,032,0002,117,632