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 listJul 3, 2026 08:25Alexander StanovoyAlexander StanovoyScore: 2,548,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 08:292,545,08821,134,397,72721,057,433,00066,798,0002,117,632
2Jul 3, 2026 08:292,545,74421,139,805,08121,064,753,00064,927,0002,117,632
3Jul 3, 2026 08:292,547,11021,150,709,74721,075,848,00065,171,0002,117,632
4Jul 3, 2026 08:292,548,32421,160,852,30521,086,094,00065,001,0002,117,632
5Jul 3, 2026 08:292,548,91121,166,278,30721,090,112,00065,856,0002,117,632
6Jul 3, 2026 08:292,550,71721,180,714,57321,104,278,00066,677,0002,117,632
7Jul 3, 2026 08:292,555,27721,218,488,00721,143,296,00065,505,0002,117,632
8Jul 3, 2026 08:292,556,71221,230,875,75721,154,636,00066,080,0002,117,632
9Jul 3, 2026 08:292,564,86021,298,439,17221,223,046,00065,299,0002,117,632