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 27, 2026 18:44Victor MerckléVictor MerckléScore: 3,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 18:443,75439,428,21529,876,0001,287,0002,113,536
2Aug 27, 2026 18:443,76440,800,37829,941,0001,307,0002,113,536
3Aug 27, 2026 18:443,76439,492,95329,952,0001,294,0002,113,536
4Aug 27, 2026 18:443,77339,588,73430,267,0001,057,0002,113,536
5Aug 27, 2026 18:443,78039,691,12830,363,0001,018,0002,113,536
6Aug 27, 2026 18:443,78739,675,53430,134,0001,299,0002,113,536
7Aug 27, 2026 18:443,79539,784,10830,474,0001,028,0002,113,536
8Aug 27, 2026 18:443,81939,877,93730,654,0001,045,0002,113,536
9Aug 27, 2026 18:443,83640,212,73330,802,0001,037,0002,113,536