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 listMay 26, 2026 11:55Kenzie_RTKenzie_RTScore: 45,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2026 11:5545,730388,830,506378,385,0001,177,0002,113,536
2May 26, 2026 11:5545,735388,808,017378,543,0001,058,0002,113,536
3May 26, 2026 11:5545,882390,645,098379,788,0001,039,0002,113,536
4May 26, 2026 11:5545,892392,918,656379,780,0001,124,0002,113,536
5May 26, 2026 11:5545,951390,669,738380,395,0001,004,0002,113,536
6May 26, 2026 11:5546,005394,020,860380,839,0001,003,0002,113,536
7May 26, 2026 11:5546,570395,706,591385,352,0001,181,0002,113,536
8May 26, 2026 11:5546,603397,799,327385,633,0001,175,0002,113,536
9May 26, 2026 11:5546,697396,822,810386,584,0001,007,0002,113,536