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 listJan 6, 2026 06:15Krrish RajKrrish RajScore: 2,066,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2026 06:152,063,60617,168,222,30917,069,955,00057,972,0002,281,472
2Jan 6, 2026 06:152,065,46217,178,770,43017,070,366,00072,967,0002,281,472
3Jan 6, 2026 06:152,065,81817,180,768,31017,084,323,00061,968,0002,281,472
4Jan 6, 2026 06:152,066,21817,179,564,31017,085,639,00063,972,0002,281,472
5Jan 6, 2026 06:152,066,53317,186,816,38217,079,249,00072,971,0002,281,472
6Jan 6, 2026 06:152,067,16917,196,025,69617,096,530,00060,969,0002,281,472
7Jan 6, 2026 06:152,070,91717,222,534,51517,117,646,00070,969,0002,281,472
8Jan 6, 2026 06:152,071,68117,230,174,56417,120,990,00073,961,0002,519,040
9Jan 6, 2026 06:152,122,56417,652,281,65217,550,317,00066,966,0002,281,472