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 26, 2026 05:46poyo180605poyo180605Score: 68,085Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 05:4668,024594,145,548508,642,00055,960,0002,289,664
2Mar 26, 2026 05:4668,050587,761,157507,830,00056,981,0002,351,104
3Mar 26, 2026 05:4668,063586,880,559493,936,00070,990,0002,289,664
4Mar 26, 2026 05:4668,067590,064,116495,963,00068,994,0002,523,136
5Mar 26, 2026 05:4668,085590,162,036505,094,00060,011,0002,289,664
6Mar 26, 2026 05:4668,087591,551,890498,108,00067,014,0002,342,912
7Mar 26, 2026 05:4668,098586,651,056485,186,00080,030,0002,269,184
8Mar 26, 2026 05:4668,210590,641,149493,122,00073,018,0002,523,136
9Mar 26, 2026 05:4668,234598,419,491507,308,00059,035,0002,289,664