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 listJan 7, 2026 09:46Petsku01Petsku01Score: 2,043,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 09:502,038,61116,950,524,10216,844,509,00075,966,0002,281,472
2Jan 7, 2026 09:502,039,08716,962,915,80716,860,449,00063,971,0002,285,568
3Jan 7, 2026 09:462,039,22116,959,428,36716,860,566,00064,971,0002,265,088
4Jan 7, 2026 09:462,043,12616,987,033,40316,884,974,00072,969,0002,281,472
5Jan 7, 2026 09:502,043,62116,997,734,07016,889,085,00072,970,0002,281,472
6Jan 7, 2026 09:462,044,76117,004,398,59816,901,541,00069,973,0002,277,376