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 3, 2025 15:54AdityaAdityaScore: 62,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 15:5462,921546,310,282521,243,0001,000,0002,506,752
2Feb 3, 2025 15:5462,959549,801,736521,562,000999,0002,281,472
3Feb 3, 2025 15:5462,973549,119,368519,681,0002,998,0002,506,752
4Feb 3, 2025 15:5462,986549,849,374521,787,000999,0002,510,848
5Feb 3, 2025 15:5462,989547,794,054520,808,0001,999,0002,510,848
6Feb 3, 2025 15:5463,009548,445,820520,976,0001,999,0002,281,472
7Feb 3, 2025 15:5463,010548,443,759520,980,0001,999,0002,510,848
8Feb 3, 2025 15:5463,027550,907,052521,124,0002,000,0002,281,472
9Feb 3, 2025 15:5463,027544,468,285519,127,0004,000,0002,506,752