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 8, 2025 22:33Ashish AhujaAshish AhujaScore: 2,306,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 22:332,305,52819,181,782,21718,784,084,000351,795,0002,387,968
2Aug 8, 2025 22:322,305,71419,185,364,33118,818,618,000318,807,0002,420,736
3Aug 8, 2025 22:322,306,16819,191,032,78418,780,361,000360,834,0002,428,928
4Aug 8, 2025 22:332,306,35519,182,803,96018,757,977,000384,773,0002,449,408
5Aug 8, 2025 22:332,309,90119,217,754,11418,812,385,000359,796,0002,510,848
6Aug 8, 2025 22:322,338,59119,456,652,45519,058,464,000351,842,0002,510,848