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 26, 2026 20:57Victor MerckléVictor MerckléScore: 4,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:574,11642,860,61333,051,0001,112,0002,113,536
2Aug 26, 2026 20:574,11743,253,75433,073,0001,101,0002,113,536
3Aug 26, 2026 20:574,11742,551,11933,093,0001,085,0002,113,536
4Aug 26, 2026 20:574,11942,608,66733,086,0001,108,0002,113,536
5Aug 26, 2026 20:574,12443,423,17233,120,0001,110,0002,113,536
6Aug 26, 2026 20:574,12543,893,16733,100,0001,143,0002,113,536
7Aug 26, 2026 20:574,13642,777,86833,228,0001,107,0002,113,536
8Aug 26, 2026 20:574,14342,750,43333,264,0001,129,0002,113,536
9Aug 26, 2026 20:574,14942,798,85633,160,0001,282,0002,113,536