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 listMar 17, 2026 15:02wnwnScore: 4,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:584,23955,520,21733,176,0002,010,0002,502,656
2Mar 17, 2026 15:024,24558,989,93033,223,0002,013,0002,273,280
3Mar 17, 2026 14:584,24856,023,35533,242,0002,014,0002,498,560
4Mar 17, 2026 14:584,25460,367,69234,303,0001,008,0002,273,280
5Mar 17, 2026 15:024,28156,338,46434,518,0001,015,0002,273,280
6Mar 17, 2026 15:024,28365,389,69034,537,0001,015,0002,273,280
7Mar 17, 2026 15:024,29360,231,82534,616,0001,018,0002,490,368
8Mar 17, 2026 15:024,32059,859,51733,864,0001,992,0002,273,280
9Mar 17, 2026 15:024,34760,794,77534,072,0002,004,0002,273,280