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 listSep 6, 2026 11:49Kevin HeaveyKevin HeaveyScore: 3,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 11:513,52138,824,02028,197,0001,032,0002,113,536
2Sep 6, 2026 11:513,52340,147,67028,168,0001,078,0002,113,536
3Sep 6, 2026 11:513,52839,207,59128,076,0001,207,0002,113,536
4Sep 6, 2026 11:513,52939,560,85428,264,0001,033,0002,113,536
5Sep 6, 2026 11:513,53439,276,69828,244,0001,093,0002,113,536
6Sep 6, 2026 11:513,53639,529,14928,314,0001,042,0002,113,536
7Sep 6, 2026 11:513,53939,464,86228,211,0001,164,0002,113,536
8Sep 6, 2026 11:513,54337,936,96928,377,0001,035,0002,113,536
9Sep 6, 2026 11:513,64040,559,43729,052,0001,160,0002,113,536