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 listFeb 2, 2026 20:46Shikhar SrivastavShikhar SrivastavScore: 2,025,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 20:462,025,15116,837,759,86816,744,785,00063,972,0002,269,184
2Feb 2, 2026 20:462,025,17716,838,921,73716,731,011,00077,962,0002,289,664
3Feb 2, 2026 20:462,025,32316,844,999,50716,744,208,00065,973,0002,281,472
4Feb 2, 2026 20:462,025,40116,849,359,51016,747,860,00062,969,0002,289,664
5Feb 2, 2026 20:462,025,42216,840,309,68916,751,026,00059,975,0002,281,472
6Feb 2, 2026 20:462,027,10116,859,176,76816,759,970,00064,972,0002,281,472
7Feb 2, 2026 20:462,032,33716,904,644,31816,806,430,00061,968,0002,281,472
8Feb 2, 2026 20:462,032,43716,901,199,79616,802,254,00066,969,0002,293,760
9Feb 2, 2026 20:462,047,87317,033,993,70616,934,370,00062,975,0002,281,472