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 29, 2026 12:54Saif Al-HarthiSaif Al-HarthiScore: 20,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 12:5419,849174,242,294163,746,0001,006,0002,113,536
2Jun 29, 2026 12:5419,886174,430,964164,045,0001,009,0002,113,536
3Jun 29, 2026 12:5420,298177,791,592167,467,0001,007,0002,113,536
4Jun 29, 2026 12:5420,310177,928,204167,567,0001,006,0002,113,536
5Jun 29, 2026 12:5420,326177,982,279167,707,0001,007,0002,113,536
6Jun 29, 2026 12:5420,332178,098,138167,754,0001,006,0002,113,536
7Jun 29, 2026 12:5420,345178,211,665167,864,0001,005,0002,113,536
8Jun 29, 2026 12:5420,364178,386,148168,025,0001,004,0002,113,536
9Jun 29, 2026 12:5420,374178,372,764168,104,0001,006,0002,113,536