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 25, 2026 00:34Victor MerckléVictor MerckléScore: 7,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 00:357,51070,787,76261,193,0001,146,0002,117,632stderr
2Aug 25, 2026 00:357,53870,912,46361,482,0001,091,0002,117,632stderr
3Aug 25, 2026 00:357,53971,084,04461,350,0001,229,0002,117,632stderr
4Aug 25, 2026 00:357,54070,967,69861,430,0001,156,0002,117,632stderr
5Aug 25, 2026 00:357,55371,084,83261,602,0001,096,0002,117,632stderr
6Aug 25, 2026 00:357,55671,806,30161,583,0001,138,0002,117,632stderr
7Aug 25, 2026 00:357,56571,202,35961,695,0001,098,0002,117,632stderr
8Aug 25, 2026 00:357,68172,257,27662,610,0001,143,0002,117,632stderr
9Aug 25, 2026 00:357,70672,320,96962,823,0001,138,0002,117,632stderr