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 listJun 19, 2026 18:02A_ShamanA_ShamanScore: 44,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 18:0443,997374,303,743282,543,00082,637,0002,113,536
2Jun 19, 2026 18:0443,997374,352,635282,621,00082,555,0002,113,536
3Jun 19, 2026 18:0444,208376,080,912282,342,00084,588,0002,113,536
4Jun 19, 2026 18:0444,508379,854,426283,455,00085,964,0002,113,536
5Jun 19, 2026 18:0444,572379,075,774283,794,00086,159,0002,113,536
6Jun 19, 2026 18:0444,706380,276,378283,960,00087,106,0002,113,536
7Jun 19, 2026 18:0444,732380,425,818283,647,00087,636,0002,113,536
8Jun 19, 2026 18:0444,958382,194,122283,918,00089,238,0002,113,536
9Jun 19, 2026 18:0445,055382,909,261284,227,00089,735,0002,113,536