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 listFeb 16, 2026 10:19tch1001tch1001Score: 71,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 10:3271,560621,869,832590,946,0002,999,0002,387,968
2Feb 16, 2026 10:1971,595616,669,255591,236,0003,001,0002,273,280
3Feb 16, 2026 10:3271,596620,965,743593,245,0001,000,0002,273,280
4Feb 16, 2026 10:3271,597622,559,943593,253,0001,000,0002,408,448
5Feb 16, 2026 10:1971,607621,851,347593,334,0001,000,0002,400,256
6Feb 16, 2026 10:1971,831622,438,957595,200,0001,000,0002,273,280