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 26, 2026 15:43Genos0Genos0Score: 75,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 15:4375,165651,017,558568,880,00054,988,0002,387,968
2Feb 26, 2026 15:4375,208645,433,159569,208,00055,020,0002,277,376
3Feb 26, 2026 15:4375,252646,516,887567,537,00057,054,0002,277,376
4Feb 26, 2026 15:4375,269646,832,706571,758,00052,977,0002,277,376
5Feb 26, 2026 15:4375,273644,924,676557,791,00066,975,0002,510,848
6Feb 26, 2026 15:4375,280650,909,536567,843,00056,984,0002,277,376
7Feb 26, 2026 15:4375,303647,561,437570,011,00055,001,0002,277,376
8Feb 26, 2026 15:4375,318649,038,670569,127,00056,012,0002,383,872
9Feb 26, 2026 15:4375,339651,723,740580,293,00045,022,0002,277,376