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 listJun 22, 2025 15:37Valentin KofmanValentin KofmanScore: 25,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 15:3725,520234,071,235209,817,0001,998,0002,289,664
2Jun 22, 2025 15:3725,525235,724,247209,856,0001,998,0002,289,664
3Jun 22, 2025 15:3725,541238,785,518209,989,0001,999,0002,277,376
4Jun 22, 2025 15:3725,572235,273,668210,242,0002,002,0002,265,088
5Jun 22, 2025 15:3725,574238,116,996211,263,0001,001,0002,289,664
6Jun 22, 2025 15:3725,575240,564,017210,272,0002,002,0002,289,664
7Jun 22, 2025 15:3725,578241,171,452211,294,0001,001,0002,269,184
8Jun 22, 2025 15:3725,590236,119,207210,398,0002,003,0002,289,664
9Jun 22, 2025 15:3725,604238,307,763211,514,0001,002,0002,289,664