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 14:56George SeabridgeGeorge SeabridgeScore: 10,913Success
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 14:5610,852100,850,98488,849,0001,230,0002,113,536
2Aug 2, 2026 14:5610,863100,165,42789,158,0001,008,0002,113,536
3Aug 2, 2026 14:5610,864100,920,79988,978,0001,198,0002,113,536
4Aug 2, 2026 14:5610,911100,551,10289,322,0001,244,0002,113,536
5Aug 2, 2026 14:5610,913100,533,06589,362,0001,224,0002,113,536
6Aug 2, 2026 14:5610,987101,103,09089,993,0001,202,0002,113,536
7Aug 2, 2026 14:5611,216103,015,97791,891,0001,210,0002,113,536
8Aug 2, 2026 14:5611,412104,889,00793,517,0001,209,0002,113,536
9Aug 2, 2026 14:5613,540122,270,917111,382,0001,007,0002,113,536