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 listAug 11, 2025 03:19Leon ZhaoLeon ZhaoScore: 57,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 03:1957,332498,535,455472,860,0002,999,0002,265,088
2Dec 17, 2025 22:3957,340503,969,250472,921,0002,999,0002,265,088
3Dec 17, 2025 22:3957,367498,963,656474,148,0002,000,0002,531,328
4Aug 11, 2025 03:1957,389500,087,685473,324,0003,002,0002,519,040
5Aug 11, 2025 03:1957,439501,246,948474,742,0001,998,0002,273,280
6Dec 17, 2025 22:3957,465500,709,252474,960,0001,999,0002,273,280