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 17, 2026 11:15DavidDavidScore: 31,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 11:1531,844273,391,200263,247,0001,059,0002,113,536
2Jun 17, 2026 11:1531,851273,417,737263,360,0001,007,0002,113,536
3Jun 17, 2026 11:1531,907273,875,492263,761,0001,069,0002,113,536
4Jun 17, 2026 11:1531,912273,920,560263,796,0001,079,0002,113,536
5Jun 17, 2026 11:1531,920274,016,984263,774,0001,166,0002,113,536
6Jun 17, 2026 11:1531,926274,164,400263,871,0001,121,0002,113,536
7Jun 17, 2026 11:1532,239276,640,053266,578,0001,008,0002,113,536
8Jun 17, 2026 11:1532,311277,111,329267,111,0001,078,0002,113,536
9Jun 17, 2026 11:1532,312277,215,461267,195,0001,002,0002,113,536