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 30, 2026 10:11Saif Al-HarthiSaif Al-HarthiScore: 13,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:1213,062117,771,957107,411,0001,011,0002,113,536
2Jun 30, 2026 10:1213,062117,840,560107,408,0001,014,0002,113,536
3Jun 30, 2026 10:1213,069117,773,738107,468,0001,011,0002,113,536
4Jun 30, 2026 10:1213,074117,837,036107,508,0001,011,0002,113,536
5Jun 30, 2026 10:1213,075117,897,159107,512,0001,014,0002,113,536
6Jun 30, 2026 10:1213,079117,912,881107,544,0001,013,0002,113,536
7Jun 30, 2026 10:1213,086117,955,307107,607,0001,010,0002,113,536
8Jun 30, 2026 10:1213,088117,945,300107,624,0001,010,0002,113,536
9Jun 30, 2026 10:1213,096118,020,526107,693,0001,009,0002,113,536