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 listFeb 22, 2025 14:00alfaixalfaixScore: 163,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2025 14:00163,8991,384,633,4521,268,406,00091,957,0002,277,376
2Feb 22, 2025 14:00163,9001,386,301,8561,269,415,00090,958,0002,289,664
3Feb 22, 2025 14:00163,9271,386,514,1901,277,620,00082,975,0002,273,280
4Feb 22, 2025 14:00163,9821,392,357,7221,294,095,00066,953,0002,273,280
5Feb 22, 2025 14:00163,9821,388,527,1291,266,120,00094,934,0002,269,184
6Feb 22, 2025 14:00164,0001,388,832,5831,264,254,00096,942,0002,269,184
7Feb 22, 2025 14:00164,0631,387,821,0241,281,736,00079,983,0002,289,664
8Feb 22, 2025 14:00164,1191,387,158,9371,301,226,00060,963,0002,277,376
9Feb 22, 2025 14:00164,1961,387,503,9411,279,834,00082,989,0002,289,664