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 18:56marko1597marko1597Score: 5,180Success
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 19:135,13751,779,83341,575,0001,066,0002,117,632
2Aug 16, 2026 19:135,14250,932,70741,540,0001,145,0002,117,632
3Aug 16, 2026 19:135,17358,496,21241,836,0001,101,0002,117,632
4Aug 16, 2026 19:135,17851,221,02741,970,0001,009,0002,117,632
5Aug 16, 2026 19:135,18051,345,54741,935,0001,064,0002,117,632
6Aug 16, 2026 19:135,19352,582,21942,032,0001,071,0002,117,632
7Aug 16, 2026 19:135,26052,034,02942,601,0001,063,0002,117,632
8Aug 16, 2026 19:135,33562,243,15042,996,0001,290,0002,117,632
9Aug 16, 2026 19:135,59354,745,80945,319,0001,104,0002,117,632