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 listMay 5, 2026 16:05M-RochatM-RochatScore: 28,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 16:1528,329251,386,889234,107,0001,030,0002,322,432
2May 5, 2026 16:1528,406253,266,817234,598,0001,176,0002,482,176
3May 5, 2026 16:1528,423252,164,220234,763,0001,149,0002,465,792
4May 5, 2026 16:1528,483255,627,627235,226,0001,184,0002,473,984
5May 5, 2026 16:1528,725263,854,610236,354,0002,071,0002,473,984
6May 5, 2026 16:1528,889256,020,802238,605,0001,178,0002,473,984
7May 5, 2026 16:1528,964255,371,200239,242,0001,166,0002,465,792
8May 5, 2026 16:1529,033259,842,520239,810,0001,168,0002,461,696
9May 5, 2026 16:1529,557261,865,406244,148,0001,183,0002,465,792