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 05:30Victor MerckléVictor MerckléScore: 3,702Success
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 05:303,68639,648,73129,446,0001,154,0002,113,536
2Aug 27, 2026 05:303,69038,886,14829,488,0001,141,0002,113,536
3Aug 27, 2026 05:303,69238,933,48829,488,0001,162,0002,113,536
4Aug 27, 2026 05:303,69539,078,81129,575,0001,098,0002,113,536
5Aug 27, 2026 05:303,70239,753,09029,579,0001,152,0002,113,536
6Aug 27, 2026 05:303,70539,817,25929,597,0001,158,0002,113,536
7Aug 27, 2026 05:303,71739,134,91429,758,0001,096,0002,113,536
8Aug 27, 2026 05:303,71739,203,23029,754,0001,105,0002,113,536
9Aug 27, 2026 05:303,79639,772,85630,402,0001,108,0002,113,536