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 11:03George SeabridgeGeorge SeabridgeScore: 7,905Success
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 11:036,65063,759,27554,003,0001,198,0002,117,632
2Aug 1, 2026 11:036,76264,635,17155,111,0001,014,0002,117,632
3Aug 1, 2026 11:037,87573,879,52664,181,0001,187,0002,117,632
4Aug 1, 2026 11:037,88374,355,11864,241,0001,189,0002,117,632
5Aug 1, 2026 11:037,90574,116,83264,609,0001,005,0002,117,632
6Aug 1, 2026 11:037,91274,253,26864,481,0001,193,0002,117,632
7Aug 1, 2026 11:037,92474,334,72364,586,0001,191,0002,117,632
8Aug 1, 2026 11:037,92674,370,39264,782,0001,009,0002,117,632
9Aug 1, 2026 11:037,93775,156,94464,696,0001,187,0002,117,632