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 24, 2026 06:35servant714servant714Score: 59,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 06:3559,382516,413,581435,889,00056,985,0002,424,832
2Mar 24, 2026 06:3559,496516,932,471435,841,00057,978,0002,281,472
3Mar 24, 2026 06:3559,557517,914,038437,284,00057,037,0002,273,280
4Mar 24, 2026 06:3559,614520,327,411435,820,00058,975,0002,273,280
5Mar 24, 2026 06:3559,621513,370,318432,872,00061,981,0002,433,024
6Mar 24, 2026 06:3559,652521,610,336437,101,00058,013,0002,273,280
7Mar 24, 2026 06:3559,671520,743,182430,367,00064,904,0002,269,184
8Mar 24, 2026 06:3559,673518,200,653435,250,00060,034,0002,289,664
9Mar 24, 2026 06:3560,057524,379,824433,415,00065,062,0002,428,928