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 08:16Karthik ReddyKarthik ReddyScore: 3,386Success
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 09:203,3023,036,712,90826,241,0001,171,00020,480
2Oct 9, 2026 09:203,3073,036,572,97726,281,0001,168,00020,480
3Oct 9, 2026 09:203,3203,036,631,60726,382,0001,177,00020,480
4Oct 9, 2026 09:203,3613,036,864,61026,736,0001,163,00020,480
5Oct 9, 2026 09:203,3863,037,117,61626,900,0001,207,00020,480
6Oct 9, 2026 09:203,3903,037,813,06926,948,0001,191,00020,480
7Oct 9, 2026 09:203,4003,037,356,68427,001,0001,221,00020,480
8Oct 9, 2026 09:203,4063,037,257,78027,059,0001,212,00020,480
9Oct 9, 2026 09:203,4203,037,480,99327,166,0001,226,00020,480