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 listJul 20, 2026 21:11Kevin HeaveyKevin HeaveyScore: 53,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 21:1253,252451,732,708439,401,0002,595,0002,117,632
2Jul 20, 2026 21:1253,292452,188,639439,847,0002,484,0002,117,632
3Jul 20, 2026 21:1253,311452,157,083439,905,0002,579,0002,117,632
4Jul 20, 2026 21:1253,325452,283,184440,209,0002,393,0002,117,632
5Jul 20, 2026 21:1253,459453,653,860441,327,0002,388,0002,117,632
6Jul 20, 2026 21:1254,083458,771,013446,227,0002,664,0002,117,632
7Jul 20, 2026 21:1254,422461,477,068449,083,0002,624,0002,117,632
8Jul 20, 2026 21:1254,428461,463,389449,364,0002,394,0002,117,632
9Jul 20, 2026 21:1254,518462,258,958450,398,0002,103,0002,117,632