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 3, 2026 20:16TudyMTudyMError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:170374,328,441356,802,0001,004,0002,379,776expected "53689824933561840 ", got "53689826823908360 "
2May 3, 2026 20:1742,958372,560,077355,556,0001,003,0002,379,776
3May 3, 2026 20:1742,976373,625,959355,700,0001,003,0002,383,872
4May 3, 2026 20:1743,116375,058,426356,860,0001,005,0002,375,680
5May 3, 2026 20:1743,123372,070,097356,918,0001,003,0002,375,680
6May 3, 2026 20:1743,151374,321,270357,152,0001,004,0002,379,776
7May 3, 2026 20:1743,164376,733,948357,259,0001,003,0002,379,776
8May 3, 2026 20:1743,184373,025,809357,425,0001,006,0002,379,776
9May 3, 2026 20:1743,191376,762,682357,487,0001,003,0002,383,872