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 16, 2026 18:56marko1597marko1597Score: 5,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 19:085,13651,023,38641,535,0001,098,0002,117,632
2Aug 16, 2026 19:085,14451,176,19241,636,0001,066,0002,117,632
3Aug 16, 2026 19:085,14851,102,10841,656,0001,078,0002,117,632
4Aug 16, 2026 19:085,15050,968,08341,558,0001,191,0002,117,632
5Aug 16, 2026 19:085,15051,068,26541,678,0001,072,0002,117,632
6Aug 16, 2026 19:085,15451,119,44841,723,0001,062,0002,117,632
7Aug 16, 2026 19:085,16051,262,34441,767,0001,063,0002,117,632
8Aug 16, 2026 19:085,16751,095,54941,691,0001,201,0002,117,632
9Aug 16, 2026 19:085,26453,644,94842,617,0001,075,0002,117,632