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 26, 2026 23:28Victor MerckléVictor MerckléScore: 4,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 23:294,08642,946,80432,771,0001,149,0002,117,632stderr
2Aug 26, 2026 23:294,11442,513,64033,061,0001,086,0002,117,632stderr
3Aug 26, 2026 23:294,11842,514,54433,091,0001,090,0002,117,632stderr
4Aug 26, 2026 23:294,12542,596,66833,146,0001,092,0002,117,632stderr
5Aug 26, 2026 23:294,14042,722,65733,259,0001,106,0002,117,632stderr
6Aug 26, 2026 23:294,16742,982,24533,502,0001,088,0002,117,632stderr
7Aug 26, 2026 23:294,18643,781,09833,609,0001,136,0002,117,632stderr
8Aug 26, 2026 23:294,20243,248,88733,770,0001,114,0002,117,632stderr
9Aug 26, 2026 23:294,40545,521,35635,487,0001,075,0002,117,632stderr