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 listJul 17, 2026 18:37Kevin HeaveyKevin HeaveyScore: 3,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 18:393,60139,665,56528,673,0001,220,0002,117,632
2Jul 17, 2026 18:393,62239,835,61928,834,0001,233,0002,117,632
3Jul 17, 2026 18:393,64139,899,22429,177,0001,044,0002,117,632
4Jul 17, 2026 18:393,79241,236,73330,438,0001,041,0002,117,632
5Jul 17, 2026 18:393,84542,681,69730,878,0001,041,0002,117,632
6Jul 17, 2026 18:393,85841,671,59630,786,0001,241,0002,117,632
7Jul 17, 2026 18:393,87941,982,17031,158,0001,039,0002,117,632
8Jul 17, 2026 18:393,88542,105,15131,202,0001,044,0002,117,632
9Jul 17, 2026 18:393,94442,556,56631,698,0001,040,0002,117,632