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:00Karthik ReddyKarthik ReddyScore: 3,320Success
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:023,3073,036,466,58026,250,0001,205,00020,480
2Oct 9, 2026 21:023,3093,036,453,58826,287,0001,180,00020,480
3Oct 9, 2026 21:023,3103,036,558,61626,267,0001,209,00020,480
4Oct 9, 2026 21:023,3123,036,225,32826,316,0001,174,00020,480
5Oct 9, 2026 21:023,3203,036,655,49126,386,0001,176,00020,480
6Oct 9, 2026 21:023,3583,036,866,68626,683,0001,195,00020,480
7Oct 9, 2026 21:023,3743,037,566,36926,808,0001,204,00020,480
8Oct 9, 2026 21:023,3743,036,998,38126,835,0001,171,00020,480
9Oct 9, 2026 21:023,4243,037,490,10027,249,0001,172,00020,480