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 2, 2026 18:08A_ShamanA_ShamanScore: 38,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 18:0938,628330,096,686319,559,0001,056,0002,113,536
2Jul 2, 2026 18:0938,630330,423,574319,511,0001,118,0002,113,536
3Jul 2, 2026 18:0938,638330,665,000319,648,0001,055,0002,113,536
4Jul 2, 2026 18:0938,641330,313,889319,670,0001,053,0002,113,536
5Jul 2, 2026 18:0938,642330,396,858319,620,0001,112,0002,113,536
6Jul 2, 2026 18:0938,643330,437,843319,737,0001,003,0002,113,536
7Jul 2, 2026 18:0938,643330,683,099319,642,0001,101,0002,113,536
8Jul 2, 2026 18:0938,649330,757,697319,690,0001,100,0002,113,536
9Jul 2, 2026 18:0938,655331,648,515319,798,0001,044,0002,113,536