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 7, 2026 09:02Kevin HeaveyKevin HeaveyScore: 6,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 09:026,69565,134,46454,449,0001,122,0002,117,632
2Jul 7, 2026 09:026,69565,067,66654,453,0001,120,0002,117,632
3Jul 7, 2026 09:026,83466,347,36555,593,0001,134,0002,117,632
4Jul 7, 2026 09:026,84266,308,50255,782,0001,010,0002,117,632
5Jul 7, 2026 09:026,84366,823,70055,681,0001,119,0002,117,632
6Jul 7, 2026 09:026,84668,064,23755,707,0001,121,0002,117,632
7Jul 7, 2026 09:026,84766,925,45455,686,0001,149,0002,117,632
8Jul 7, 2026 09:026,86566,480,37155,875,0001,112,0002,117,632
9Jul 7, 2026 09:026,88366,690,18355,980,0001,153,0002,117,632