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 21, 2025 14:10Valentin KofmanValentin KofmanScore: 371,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 14:10371,0183,102,836,6842,989,495,00089,954,0002,289,664
2Jun 21, 2025 14:10371,3803,109,313,3792,998,522,00083,930,0002,326,528
3Jun 21, 2025 14:10371,5273,111,549,6123,003,709,00079,965,0002,281,472
4Jun 21, 2025 14:10371,5363,107,530,0522,997,785,00085,965,0002,281,472
5Jun 21, 2025 14:10371,7503,113,396,2233,012,560,00072,965,0002,289,664
6Jun 21, 2025 14:10371,9423,121,495,3033,010,167,00076,953,0002,289,664
7Jun 21, 2025 14:10372,0353,115,791,8513,018,936,00068,952,0002,281,472
8Jun 21, 2025 14:10373,6953,133,184,9743,026,702,00074,967,0002,281,472
9Jun 21, 2025 14:10377,3233,156,684,0043,070,803,00060,976,0002,289,664