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 listMay 13, 2026 17:49Victor MerckléVictor MerckléScore: 382,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:50382,3493,183,954,6523,172,449,0001,054,0002,117,632stderr
2May 13, 2026 17:50382,4693,181,830,1213,173,429,0001,069,0002,117,632stderr
3May 13, 2026 17:50382,6123,184,111,6133,174,414,0001,270,0002,117,632stderr
4May 13, 2026 17:50382,8323,186,432,5353,176,487,0001,019,0002,117,632stderr
5May 13, 2026 17:50382,9793,188,367,1783,175,721,0003,009,0002,117,632stderr
6May 13, 2026 17:50383,0663,186,871,8223,178,417,0001,035,0002,117,632stderr
7May 13, 2026 17:50383,3703,192,573,4603,180,966,0001,005,0002,117,632stderr
8May 13, 2026 17:50383,3983,189,573,0233,181,042,0001,164,0002,117,632stderr
9May 13, 2026 17:50383,9273,195,860,4743,185,582,0001,016,0002,117,632stderr