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 15, 2026 20:13wnwnScore: 11,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 20:139,368103,319,82269,779,0007,974,0002,408,448
2Feb 15, 2026 20:139,385100,258,63471,901,0005,991,0002,473,984
3Feb 15, 2026 20:139,594106,607,91572,572,0007,055,0002,289,664
4Feb 15, 2026 20:1311,239121,269,25483,252,00010,030,0002,306,048
5Feb 15, 2026 20:1311,297122,091,68287,777,0005,984,0002,457,600
6Feb 15, 2026 20:1311,381126,286,70886,420,0008,039,0002,453,504
7Feb 15, 2026 20:1311,388116,010,67086,478,0008,044,0002,318,336
8Feb 15, 2026 20:1311,391123,569,22486,503,0008,046,0002,441,216
9Feb 15, 2026 20:1311,423123,699,24484,834,0009,980,0002,510,848
10Feb 15, 2026 20:1311,554119,488,70884,914,00010,988,0002,465,792
11Feb 15, 2026 20:1311,809121,277,57988,015,00010,001,0002,469,888
12Feb 15, 2026 20:1311,906122,911,36189,833,0008,983,0002,457,600