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 listMar 13, 2026 12:43Eric CeglieEric CeglieScore: 26,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 12:4326,883251,006,156221,125,0002,001,0002,289,664
2Mar 13, 2026 12:4326,893253,769,658221,210,0002,001,0002,285,568
3Mar 13, 2026 12:4326,894247,728,457222,222,0001,001,0002,260,992
4Mar 13, 2026 12:4326,902248,298,449223,288,00002,519,040
5Mar 13, 2026 12:4326,908245,321,869222,338,0001,001,0002,285,568
6Mar 13, 2026 12:4326,911244,418,519222,359,0001,001,0002,285,568
7Mar 13, 2026 12:4326,921252,462,048222,445,0001,002,0002,506,752
8Mar 13, 2026 12:4326,924249,678,544223,467,00002,351,104
9Mar 13, 2026 12:4326,952252,054,176221,702,0001,997,0002,506,752