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 listOct 15, 2026 02:47zayd-ansari-codezayd-ansari-codeScore: 87,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 02:4787,359735,456,343663,900,00061,187,0002,113,536
2Oct 15, 2026 02:4787,405736,084,256663,854,00061,611,0002,113,536
3Oct 15, 2026 02:4787,436736,238,636663,614,00062,109,0002,113,536
4Oct 15, 2026 02:4787,436736,187,585664,173,00061,552,0002,113,536
5Oct 15, 2026 02:4787,451737,844,926663,583,00062,265,0002,113,536
6Oct 15, 2026 02:4787,478736,495,234664,371,00061,702,0002,113,536
7Oct 15, 2026 02:4787,479736,870,892663,744,00062,334,0002,113,536
8Oct 15, 2026 02:4787,515736,744,581664,234,00062,148,0002,113,536
9Oct 15, 2026 02:4787,583737,343,981664,283,00062,656,0002,113,536