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 13:17Victor MerckléVictor MerckléScore: 6,192Success
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 13:176,15659,058,11450,029,0001,071,0002,113,536
2Jun 10, 2026 13:176,16258,714,54850,091,0001,056,0002,113,536
3Jun 10, 2026 13:176,18458,772,63850,276,0001,059,0002,113,536
4Jun 10, 2026 13:176,18759,003,34850,286,0001,069,0002,113,536
5Jun 10, 2026 13:176,19259,360,84250,318,0001,077,0002,113,536
6Jun 10, 2026 13:176,20359,376,71750,414,0001,075,0002,113,536
7Jun 10, 2026 13:176,20659,396,89650,407,0001,111,0002,113,536
8Jun 10, 2026 13:176,21358,951,79150,483,0001,092,0002,113,536
9Jun 10, 2026 13:176,25659,556,66150,921,0001,009,0002,113,536