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 2, 2026 18:19Karthik ReddyKarthik ReddyScore: 4,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 18:203,9886,042,424,75527,894,0005,214,00020,480
2Oct 2, 2026 18:203,9966,042,421,43128,029,0005,145,00020,480
3Oct 2, 2026 18:204,0056,042,530,75727,955,0005,293,00020,480
4Oct 2, 2026 18:204,0446,042,805,93028,305,0005,268,00020,480
5Oct 2, 2026 18:204,0526,043,008,93328,418,0005,219,00020,480
6Oct 2, 2026 18:204,0686,043,064,05528,302,0005,470,00020,480
7Oct 2, 2026 18:204,0776,043,298,34628,258,0005,586,00020,480
8Oct 2, 2026 18:204,1216,043,462,12729,097,0005,112,00020,480
9Oct 2, 2026 18:204,3056,045,106,38530,155,0005,580,00020,480