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 17, 2026 10:53limanjun99limanjun99Score: 5,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 10:535,88776,251,66646,867,0001,994,0002,289,664
2Mar 17, 2026 10:535,89174,650,64245,899,0002,993,0002,289,664
3Mar 17, 2026 10:535,90385,179,67246,999,0001,999,0002,289,664
4Mar 17, 2026 10:535,90466,257,93546,006,0003,000,0002,502,656
5Mar 17, 2026 10:535,90972,197,92348,041,0001,000,0002,289,664
6Mar 17, 2026 10:535,90977,903,07046,042,0003,002,0002,482,176
7Mar 17, 2026 10:535,92269,821,23346,144,0003,009,0002,490,368
8Mar 17, 2026 10:535,92876,242,63147,191,0002,008,0002,494,464
9Mar 17, 2026 10:535,96075,049,14547,446,0002,018,0002,486,272