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 14, 2026 21:00boop34boop34Score: 14,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 21:0114,139127,010,928116,303,0001,053,0002,113,536
2Jul 14, 2026 21:0114,151127,109,798116,397,0001,064,0002,113,536
3Jul 14, 2026 21:0114,168127,355,712116,564,0001,038,0002,113,536
4Jul 14, 2026 21:0114,178127,294,467116,563,0001,118,0002,113,536
5Jul 14, 2026 21:0114,189127,557,116116,767,0001,007,0002,113,536
6Jul 14, 2026 21:0114,351129,233,457118,042,0001,073,0002,113,536
7Jul 14, 2026 21:0114,447130,209,967118,846,0001,065,0002,113,536
8Jul 14, 2026 21:0114,458132,425,908118,954,0001,054,0002,113,536
9Jul 14, 2026 21:0114,479130,480,147119,105,0001,073,0002,113,536