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 9, 2026 21:30Karthik ReddyKarthik ReddyScore: 3,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 21:343,2513,035,852,55725,956,0001,035,00020,480
2Oct 9, 2026 21:343,2563,035,868,11526,006,0001,027,00020,480
3Oct 9, 2026 21:343,2573,035,902,53826,011,0001,028,00020,480
4Oct 9, 2026 21:343,2583,035,960,48026,024,0001,020,00020,480
5Oct 9, 2026 21:343,2593,035,805,84325,999,0001,055,00020,480
6Oct 9, 2026 21:343,2633,035,925,45526,056,0001,035,00020,480
7Oct 9, 2026 21:343,2723,036,000,14326,106,0001,052,00020,480
8Oct 9, 2026 21:343,3493,036,702,10226,730,0001,068,00020,480
9Oct 9, 2026 21:343,3753,036,815,14927,007,0001,010,00020,480