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 25, 2026 10:00timothygktimothygkScore: 9,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 10:019,83092,576,32570,705,00010,890,0002,117,632stderr
2Oct 25, 2026 10:019,87892,920,13871,033,00010,956,0002,117,632stderr
3Oct 25, 2026 10:019,88093,388,69270,441,00011,571,0002,117,632stderr
4Oct 25, 2026 10:019,88393,580,90970,815,00011,219,0002,117,632stderr
5Oct 25, 2026 10:019,91393,255,79770,657,00011,627,0002,117,632stderr
6Oct 25, 2026 10:019,94894,808,77971,498,00011,078,0002,117,632stderr
7Oct 25, 2026 10:019,96194,190,50171,840,00010,841,0002,117,632stderr
8Oct 25, 2026 10:019,99893,886,85072,092,00010,898,0002,117,632stderr
9Oct 25, 2026 10:0110,11595,072,17872,458,00011,504,0002,117,632stderr