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 listJun 30, 2026 08:57Victor MerckléVictor MerckléScore: 8,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 08:588,38177,230,72868,483,0001,081,0002,117,632stderr
2Jun 30, 2026 08:588,38577,628,44268,492,0001,110,0002,117,632stderr
3Jun 30, 2026 08:588,39077,732,53568,599,0001,039,0002,117,632stderr
4Jun 30, 2026 08:588,39277,566,94868,559,0001,101,0002,117,632stderr
5Jun 30, 2026 08:588,42077,791,91768,786,0001,102,0002,117,632stderr
6Jun 30, 2026 08:588,42678,300,87168,938,0001,005,0002,117,632stderr
7Jun 30, 2026 08:588,43078,186,81668,862,0001,111,0002,117,632stderr
8Jun 30, 2026 08:588,43377,949,78968,869,0001,131,0002,117,632stderr
9Jun 30, 2026 08:588,44978,016,08369,123,0001,010,0002,117,632stderr