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 listAug 4, 2026 16:14boop34boop34Score: 29,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 16:1528,463246,255,438235,203,0001,045,0002,113,536
2Aug 4, 2026 16:1529,562255,332,360244,320,0001,048,0002,113,536
3Aug 4, 2026 16:1529,574255,623,470244,422,0001,044,0002,113,536
4Aug 4, 2026 16:1529,582256,326,688244,476,0001,057,0002,113,536
5Aug 4, 2026 16:1529,645256,939,780245,017,0001,042,0002,113,536
6Aug 4, 2026 16:1529,655256,960,027245,080,0001,060,0002,113,536
7Aug 4, 2026 16:1529,661256,995,484245,146,0001,048,0002,113,536
8Aug 4, 2026 16:1529,664256,982,891245,161,0001,055,0002,113,536
9Aug 4, 2026 16:1529,793257,395,840246,239,0001,047,0002,113,536