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 20, 2026 02:28Victor MerckléVictor MerckléScore: 7,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 02:297,54870,290,75961,592,0001,059,0002,113,536
2Jun 20, 2026 02:297,54970,355,17261,597,0001,065,0002,113,536
3Jun 20, 2026 02:297,55470,380,30961,608,0001,092,0002,113,536
4Jun 20, 2026 02:297,58670,956,05261,949,0001,020,0002,113,536
5Jun 20, 2026 02:297,59270,635,57762,012,0001,009,0002,113,536
6Jun 20, 2026 02:297,66971,278,65962,595,0001,062,0002,113,536
7Jun 20, 2026 02:297,87072,984,47964,263,0001,061,0002,113,536
8Jun 20, 2026 02:297,87272,948,31864,257,0001,082,0002,113,536
9Jun 20, 2026 02:297,92573,421,22164,756,0001,024,0002,113,536