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 listJun 10, 2026 13:29Victor MerckléVictor MerckléScore: 8,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 13:307,96273,457,65765,067,0001,024,0002,117,632stderr
2Jun 10, 2026 13:307,99273,761,01865,316,0001,025,0002,117,632stderr
3Jun 10, 2026 13:308,01173,866,97265,462,0001,031,0002,117,632stderr
4Jun 10, 2026 13:308,10175,068,17566,208,0001,037,0002,117,632stderr
5Jun 10, 2026 13:308,10574,651,96866,152,0001,122,0002,117,632stderr
6Jun 10, 2026 13:308,14274,952,37066,537,0001,042,0002,117,632stderr
7Jun 10, 2026 13:308,14674,983,91466,610,0001,008,0002,117,632stderr
8Jun 10, 2026 13:308,15375,351,91566,658,0001,015,0002,117,632stderr
9Jun 10, 2026 13:308,16775,223,85166,762,0001,028,0002,117,632stderr