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 11, 2026 16:20Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:21039,516,95231,059,0001,091,0002,113,536expected "53690302727280238 ", got "53690302471280238 "
2May 11, 2026 16:21039,637,93631,217,0001,075,0002,113,536expected "53684109439426275 ", got "53684109183426275 "
3May 11, 2026 16:21042,598,97431,232,0001,039,0002,113,536expected "53682764377003517 ", got "53682763518328776 "
4May 11, 2026 16:213,86541,419,99230,994,0001,093,0002,113,536
5May 11, 2026 16:213,86941,241,45831,104,0001,012,0002,113,536
6May 11, 2026 16:213,87941,290,05931,155,0001,043,0002,113,536
7May 11, 2026 16:213,88141,319,22831,144,0001,075,0002,113,536
8May 11, 2026 16:213,88740,464,39131,160,0001,103,0002,113,536
9May 11, 2026 16:214,17343,282,33032,366,0002,274,0002,113,536