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 26, 2026 06:02poyo180605poyo180605Score: 62,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 06:0262,323537,316,366468,254,00049,026,0002,502,656
2Mar 26, 2026 06:0262,346544,242,575469,522,00047,951,0002,498,560
3Mar 26, 2026 06:0262,369547,250,681479,685,00037,975,0002,289,664
4Mar 26, 2026 06:0262,390540,660,877457,854,00059,980,0002,293,760
5Mar 26, 2026 06:0262,397539,691,298480,905,00036,992,0002,293,760
6Mar 26, 2026 06:0262,416545,080,777474,052,00044,004,0002,285,568
7Mar 26, 2026 06:0262,433542,181,859454,169,00064,023,0002,289,664
8Mar 26, 2026 06:0262,452551,752,576463,419,00054,931,0002,506,752
9Mar 26, 2026 06:0262,454551,067,036469,335,00049,035,0002,289,664