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 listDec 9, 2025 10:51Gunsoo KimGunsoo KimScore: 62,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 10:5162,426539,352,114458,119,00060,015,0002,289,664
2Dec 9, 2025 10:5162,453544,469,386458,316,00060,041,0002,289,664
3Dec 9, 2025 10:5162,461546,920,157460,381,00058,048,0002,289,664
4Dec 9, 2025 10:5162,544540,864,850461,101,00058,012,0002,277,376
5Dec 9, 2025 10:5162,604541,776,017463,547,00056,066,0002,289,664
6Dec 9, 2025 10:5162,729546,502,685462,693,00057,961,0002,285,568
7Dec 9, 2025 10:5162,788545,156,536458,124,00063,017,0002,269,184
8Dec 9, 2025 10:5162,789551,012,369459,128,00062,017,0002,285,568
9Dec 9, 2025 10:5162,876544,842,453460,889,00060,985,0002,289,664