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 1, 2026 19:17George SeabridgeGeorge SeabridgeScore: 9,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 19:178,62181,548,75370,473,0001,084,0002,113,536
2Aug 1, 2026 19:179,26387,141,71875,768,0001,115,0002,113,536
3Aug 1, 2026 19:179,71090,557,40579,503,0001,090,0002,113,536
4Aug 1, 2026 19:179,71390,605,98079,520,0001,099,0002,113,536
5Aug 1, 2026 19:179,72390,784,45279,609,0001,092,0002,113,536
6Aug 1, 2026 19:179,72390,830,19279,610,0001,091,0002,113,536
7Aug 1, 2026 19:179,72490,729,48079,603,0001,111,0002,113,536
8Aug 1, 2026 19:179,72591,482,03279,633,0001,091,0002,113,536
9Aug 1, 2026 19:179,73490,809,82879,705,0001,089,0002,113,536