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 listMar 13, 2026 10:29Hung T.NguyenHung T.NguyenScore: 48,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 10:2948,678424,975,404403,030,0001,000,0002,527,232
2Mar 13, 2026 10:2948,679427,264,091403,033,0001,000,0002,428,928
3Mar 13, 2026 10:2948,681426,703,234403,051,0001,000,0002,531,328
4Mar 13, 2026 10:2948,705428,838,442403,249,0001,000,0002,531,328
5Mar 13, 2026 10:2948,705424,526,133404,255,00002,424,832
6Mar 13, 2026 10:2948,709427,522,468402,281,0002,001,0002,281,472
7Mar 13, 2026 10:2948,709426,839,227403,288,0001,000,0002,433,024
8Mar 13, 2026 10:2948,710429,986,871403,297,0001,000,0002,441,216
9Mar 13, 2026 10:2948,716428,359,059403,345,000998,0002,527,232