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 listJan 1, 2026 20:06Josu San MartinJosu San MartinScore: 7,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 20:066,76776,927,63053,157,0003,008,0002,445,312
2Jan 1, 2026 20:066,78376,816,52252,280,0004,021,0002,383,872
3Jan 1, 2026 20:066,78878,970,29854,328,0002,012,0002,486,272
4Jan 1, 2026 20:067,07983,512,71456,768,0001,991,0002,347,008
5Jan 1, 2026 20:067,08182,342,72955,784,0002,988,0002,347,008
6Jan 1, 2026 20:067,08284,814,62654,799,0003,985,0002,334,720