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 listSep 17, 2026 02:55Andrew EpsteinAndrew EpsteinScore: 44,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:5644,290377,959,665365,434,0002,174,0002,121,728stderr
2Sep 17, 2026 02:5644,319378,213,855365,638,0002,215,0002,117,632stderr
3Sep 17, 2026 02:5644,337378,365,388365,835,0002,167,0002,121,728stderr
4Sep 17, 2026 02:5644,418379,125,596365,290,0003,384,0002,121,728stderr
5Sep 17, 2026 02:5644,472379,634,974366,937,0002,188,0002,121,728stderr
6Sep 17, 2026 02:5644,483379,561,116367,012,0002,201,0002,121,728stderr
7Sep 17, 2026 02:5644,532380,684,060367,431,0002,186,0002,121,728stderr
8Sep 17, 2026 02:5644,551380,250,439367,577,0002,202,0002,121,728stderr
9Sep 17, 2026 02:5644,609380,677,295368,086,0002,174,0002,121,728stderr