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 29, 2026 02:13Victor MerckléVictor MerckléScore: 5,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 02:145,39552,713,12243,718,0001,066,0002,113,536
2Jun 29, 2026 02:145,42652,894,30244,020,0001,024,0002,113,536
3Jun 29, 2026 02:145,42952,971,47444,034,0001,034,0002,113,536
4Jun 29, 2026 02:145,43353,053,32144,090,0001,004,0002,113,536
5Jun 29, 2026 02:145,43653,087,41144,044,0001,083,0002,113,536
6Jun 29, 2026 02:145,45053,092,95544,212,0001,029,0002,113,536
7Jun 29, 2026 02:145,47553,297,32144,412,0001,032,0002,113,536
8Jun 29, 2026 02:145,48153,391,99144,488,0001,005,0002,113,536
9Jun 29, 2026 02:145,55254,036,90744,985,0001,100,0002,113,536