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 5, 2026 14:34howenhowenScore: 90,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 14:3490,442775,073,408522,769,000227,899,0002,469,888
2Feb 5, 2026 14:3490,543778,296,082521,655,000229,848,0002,490,368
3Feb 5, 2026 14:3490,696782,433,816520,844,000231,930,0002,285,568
4Feb 5, 2026 14:3490,851784,214,865520,354,000233,710,0002,314,240
5Feb 5, 2026 14:3490,921782,454,351520,754,000233,889,0002,465,792
6Feb 5, 2026 14:3490,925776,806,450520,778,000233,900,0002,306,048
7Feb 5, 2026 14:3490,999780,132,326522,512,000232,782,0002,473,984
8Feb 5, 2026 14:3491,292787,988,629521,808,000235,913,0002,482,176
9Feb 5, 2026 14:3491,598792,109,555519,498,000240,767,0002,371,584