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 15, 2026 22:36marko1597marko1597Score: 150,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:57149,0311,247,154,3031,235,723,0001,236,0002,117,632stderr
2Aug 15, 2026 22:57149,1041,247,735,2881,236,407,0001,162,0002,117,632stderr
3Aug 15, 2026 22:57149,8501,253,782,2221,242,753,0001,002,0002,117,632stderr
4Aug 15, 2026 22:57149,9751,256,042,6211,243,796,0001,001,0002,117,632stderr
5Aug 15, 2026 22:57150,1281,256,152,8751,245,067,0001,002,0002,117,632stderr
6Aug 15, 2026 22:57150,2481,257,135,9951,245,897,0001,167,0002,117,632stderr
7Aug 15, 2026 22:57150,2711,257,345,7241,246,005,0001,245,0002,117,632stderr
8Aug 15, 2026 22:57150,3041,257,518,2211,246,523,0001,001,0002,117,632stderr
9Aug 15, 2026 22:57150,5281,259,479,7791,248,128,0001,255,0002,117,632stderr