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 1, 2026 07:58Karthik ReddyKarthik ReddyScore: 3,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 07:583,48737,965,06627,851,0001,099,0002,113,536
2Oct 1, 2026 07:583,48937,953,85727,881,0001,085,0002,113,536
3Oct 1, 2026 07:583,49137,942,34927,896,0001,082,0002,113,536
4Oct 1, 2026 07:583,49338,045,04727,897,0001,102,0002,113,536
5Oct 1, 2026 07:583,49538,023,01227,913,0001,099,0002,113,536
6Oct 1, 2026 07:583,49938,064,07027,962,0001,085,0002,113,536
7Oct 1, 2026 07:583,50038,087,96827,951,0001,104,0002,113,536
8Oct 1, 2026 07:583,50638,046,24327,968,0001,133,0002,113,536
9Oct 1, 2026 07:583,51538,191,88028,162,0001,013,0002,113,536