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 listSep 7, 2026 15:14Kevin PetersKevin PetersScore: 74,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:1574,174625,567,018558,188,00057,458,0002,113,536
2Sep 7, 2026 15:1574,178625,648,603558,066,00057,612,0002,113,536
3Sep 7, 2026 15:1574,191625,745,889558,075,00057,716,0002,113,536
4Sep 7, 2026 15:1574,193625,838,950558,123,00057,681,0002,113,536
5Sep 7, 2026 15:1574,231626,100,229558,542,00057,581,0002,113,536
6Sep 7, 2026 15:1574,254626,432,943557,908,00058,405,0002,113,536
7Sep 7, 2026 15:1574,270626,470,890558,337,00058,104,0002,113,536
8Sep 7, 2026 15:1574,285627,227,184558,502,00058,068,0002,113,536
9Sep 7, 2026 15:1574,328626,960,429558,112,00058,818,0002,113,536