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 listJan 2, 2026 18:13Josu San MartinJosu San MartinScore: 14,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 18:1311,297118,741,28390,775,0002,992,0002,404,352
2Jan 2, 2026 18:1311,419120,593,51493,781,000997,0002,387,968
3Jan 2, 2026 18:1311,422117,975,06593,805,000997,0002,285,568
4Jan 2, 2026 18:1314,845148,356,726123,216,00002,273,280
5Jan 2, 2026 18:1314,937151,035,813121,980,0001,999,0002,277,376
6Jan 2, 2026 18:1315,172150,250,141123,932,0001,998,0002,273,280