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 22, 2026 16:54timothygktimothygkScore: 16,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2026 16:5516,098144,543,680128,228,0005,393,0002,117,632stderr
2Oct 22, 2026 16:5516,133144,879,548128,419,0005,486,0002,117,632stderr
3Oct 22, 2026 16:5516,135146,275,274128,496,0005,429,0002,117,632stderr
4Oct 22, 2026 16:5516,145145,048,485128,596,0005,410,0002,117,632stderr
5Oct 22, 2026 16:5516,154145,656,000128,400,0005,684,0002,117,632stderr
6Oct 22, 2026 16:5516,180145,749,162128,743,0005,553,0002,117,632stderr
7Oct 22, 2026 16:5516,183145,414,695128,751,0005,571,0002,117,632stderr
8Oct 22, 2026 16:5516,200145,873,205128,770,0005,696,0002,117,632stderr
9Oct 22, 2026 16:5516,419147,320,754130,761,0005,518,0002,117,632stderr