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 10, 2026 16:18Victor MerckléVictor MerckléScore: 7,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 16:187,59070,577,11460,956,0002,048,0002,113,536
2Jun 10, 2026 16:187,67671,241,17961,602,0002,111,0002,113,536
3Jun 10, 2026 16:187,75071,893,54162,259,0002,067,0002,113,536
4Jun 10, 2026 16:187,77572,118,92462,474,0002,062,0002,113,536
5Jun 10, 2026 16:187,78972,213,43062,502,0002,147,0002,113,536
6Jun 10, 2026 16:187,82972,631,78262,874,0002,114,0002,113,536
7Jun 10, 2026 16:187,83872,658,17363,015,0002,045,0002,113,536
8Jun 10, 2026 16:187,86972,825,90663,286,0002,027,0002,113,536
9Jun 10, 2026 16:188,01074,131,90164,374,0002,110,0002,113,536