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 5, 2026 01:54FrederickFrederickScore: 12,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 01:5411,898109,178,90297,749,0001,008,0002,117,632
2Oct 5, 2026 01:5411,952109,611,81998,200,0001,008,0002,117,632
3Oct 5, 2026 01:5412,173111,730,716100,032,0001,008,0002,117,632
4Oct 5, 2026 01:5412,353113,632,722101,522,0001,008,0002,117,632
5Oct 5, 2026 01:5412,456114,509,812102,384,0001,008,0002,117,632
6Oct 5, 2026 01:5412,484114,768,605102,608,0001,010,0002,117,632
7Oct 5, 2026 01:5412,515115,141,852102,868,0001,010,0002,117,632
8Oct 5, 2026 01:5412,881118,004,436105,908,0001,008,0002,117,632
9Oct 5, 2026 01:5413,062119,540,306107,412,0001,008,0002,117,632