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 2, 2026 17:38George SeabridgeGeorge SeabridgeScore: 53,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:3852,361445,242,913432,369,0002,230,0002,113,536
2Aug 2, 2026 17:3852,612446,616,159434,438,0002,243,0002,113,536
3Aug 2, 2026 17:3852,645446,845,560434,776,0002,178,0002,113,536
4Aug 2, 2026 17:3852,889449,544,736436,791,0002,191,0002,113,536
5Aug 2, 2026 17:3853,226451,573,632439,554,0002,230,0002,113,536
6Aug 2, 2026 17:3854,049458,451,077446,352,0002,259,0002,113,536
7Aug 2, 2026 17:3861,139517,343,177505,181,0002,277,0002,113,536
8Aug 2, 2026 17:3868,127575,906,209563,273,0002,184,0002,113,536
9Aug 2, 2026 17:3881,988690,345,721678,500,0002,004,0002,113,536