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:12marko1597marko1597Score: 5,354Success
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 18:334,58346,479,87637,006,0001,033,0002,117,632
2Aug 16, 2026 18:334,59246,550,36337,082,0001,036,0002,117,632
3Aug 16, 2026 18:334,60746,678,36437,199,0001,046,0002,117,632
4Aug 16, 2026 18:334,64246,985,12237,422,0001,109,0002,117,632
5Aug 16, 2026 18:335,35452,937,34343,369,0001,076,0002,117,632
6Aug 16, 2026 18:335,43653,600,94944,081,0001,044,0002,117,632
7Aug 16, 2026 18:336,28060,595,67251,085,0001,042,0002,117,632
8Aug 16, 2026 18:336,45771,485,30752,415,0001,182,0002,117,632
9Aug 16, 2026 18:336,48062,235,60752,666,0001,122,0002,117,632